Linearizing Term Rewriting Systems Using Test Sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linearizing sets: each other

It is has been well known since Fiengo and Lasnik (1973) and Langendoen (1978) that each other presents a high degree of contextual variability. In a tradition that goes back to Langendoen (1978) and later to Dalrymple et al. (1998), theoreticians have tried to list different truth conditions and to establish a criterion for determining which one holds in which particular context. Along the lin...

متن کامل

Refutational Theorem Proving Using Term-Rewriting Systems

In this paper we propose a new approach to theorem proving in first-order logic based on the term-rewriting method. First for propositional calculus, we introduce a canonical term-rewriting system for Boolean algebra. This system enables us to transform the first-order predicate calculus into a form of equational logic, and to develop several complete strategies (both clausal and nonclausal) fo...

متن کامل

Orderal Term Rewriting Systems

This article describes a generalization of term rewriting system technique used as a basis for decision algorithm for equational theories. The or-deral term rewriting system technique is presented. The main innovation of the proposed technique is that reductions according to some rules of such a system are performed only if special restrictions are satissed. The restrictions are based on term o...

متن کامل

Extended Term Rewriting Systems

In this paper we will consider some extensions of the usual term rewrite format, namely: term rewriting with conditions, infmi~y term rewriting and term rewriting with bound variables. Rather than aiming at a complete survey, we discuss some aspects of these three extensions.

متن کامل

Learning Term Rewriting Systems

Learning from entailment is a learning model suitable for learning rst-order formulas, in which examples are formulas in the rst-order language which are implied or not implied. In this paper, we study the learnability of term rewriting systems in this framework. A term rewriting system is a simple model of tree transduction used for semi-structured data and Web, which can be considered as a fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1994

ISSN: 0747-7171

DOI: 10.1006/jsco.1994.1005